MOIMPA: multi-objective improved marine predators algorithm for solving multi-objective optimization problems

نویسندگان

چکیده

Abstract This paper introduces a multi-objective variant of the marine predators algorithm (MPA) called improved (MOIMPA), which incorporates concepts from Quantum theory. By leveraging theory, MOIMPA aims to enhance MPA’s ability balance between exploration and exploitation find optimal solutions. The utilizes concept inspired by Schrödinger wave function determine position particles in search space. modification improves both exploitation, resulting enhanced performance. Additionally, proposed Pareto dominance mechanism. It stores non-dominated solutions repository employs roulette wheel strategy select repository, considering their coverage. To evaluate effectiveness efficiency MOIMPA, tests are conducted on various benchmark functions, including ZDT DTLZ, as well using evolutionary computation 2009 (CEC’09) test suite. is also evaluated engineering design problems. A comparison made approach other well-known optimization methods, such MOMPA, ant lion optimizer, multi-verse optimization. statistical results demonstrate robustness approach, measured metrics like inverted generational distance, generalized spacing, delta. Furthermore, qualitative experimental confirm that provides highly accurate approximations true fronts.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-objective Phylogenetic Algorithm: Solving Multi-objective Decomposable Deceptive Problems

In general, Multi-objective Evolutionary Algorithms do not guarantee find solutions in the Pareto-optimal set. We propose a new approach for solving decomposable deceptive multi-objective problems that can find all solutions of the Pareto-optimal set. Basically, the proposed approach starts by decomposing the problem into subproblems and, then, combining the found solutions. The resultant appro...

متن کامل

An Improved Multi-Objective Genetic Algorithm for Solving Multi-objective Problems

Multi-objective optimization (MO) has been an active area of research in the last two decades. In multi-objective genetic algorithm (MOGA), the quality of newly generated offspring of the population will directly affect the performance of finding the Pareto optimum. In this paper, an improved MOGA, named SMGA, is proposed for solving multi-objective optimization problems. To increase efficiency...

متن کامل

Differential Evolution Algorithm for Solving Multi-objective Optimization Problems

This paper presents a modified Differential Evolution (DE) algorithm called OCMODE for solving multi-objective optimization problems. First, the initialization phase is improved by using the opposition based learning. Further, a time varying scale factor F employing chaotic sequence is used which helps to get a well distributed Pareto front by the help of non dominated and crowding distance sor...

متن کامل

An Improved Differential Evolution Algorithm for Multi-objective Optimization Problems

In this paper, an improved multi-objective differential evolution algorithm(IDEA) is proposed for multi-objective optimization problems. In IDEA, the select operator combines the advantages of DE with the mechanisms of Pareto-based ranking and distance density, besides, a randomly migration strategy is proposed. IDEA is implemented on four classical multi-objective problems, the simulation resu...

متن کامل

A Hybrid MOEA/D-TS for Solving Multi-Objective Problems

In many real-world applications, various optimization problems with conflicting objectives are very common. In this paper we employ Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D), a newly developed method, beside Tabu Search (TS) accompaniment to achieve a new manner for solving multi-objective optimization problems (MOPs) with two or three conflicting objectives. This i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Soft Computing

سال: 2023

ISSN: ['1433-7479', '1432-7643']

DOI: https://doi.org/10.1007/s00500-023-08812-7